Generating Context-Free Grammars using Classical Planning
نویسندگان
چکیده
This paper presents a novel approach for generating Context-Free Grammars (CFGs) from small sets of input strings (a single input string in some cases). Our approach is to compile this task into a classical planning problem whose solutions are sequences of actions that build and validate a CFG compliant with the input strings. In addition, we show that our compilation is suitable for implementing the two canonical tasks for CFGs, string production and string recognition.
منابع مشابه
Deterministic graph grammars
Context-free grammars are one of the most classical and fundamental notions in computer science textbooks, in both theoretical and applied settings. As characterizations of the well-known class of context-free languages, they are a very prominent tool in the field of language theory. Since contextfree grammars are powerful enough to express most programming languages, they also play an importan...
متن کاملA Comparison of Boundary Graph Grammars and Context-Free Hypergraph Grammars
Context-free hypergraph grammars and boundary graph grammars of bounded nonterminal degree have the same power, both for generating sets of graphs and for generating sets of hypergraphs. Arbitrary boundary graph grammars have more graph generating power than context-free hypergraph grammars, but they have the same hypergraph generating power. To obtain these results, several normal forms for bo...
متن کاملQuantum automata and quantum grammars
To study quantum computation, it might be helpful to generalize structures from language and automata theory to the quantum case. To that end, we propose quantum versions of finite-state and push-down automata, and regular and context-free grammars. We find analogs of several classical theorems, including pumping lemmas, closure properties, rational and algebraic generating functions, and Greib...
متن کاملSecond-Order Abstract Categorial Grammars as Hyperedge Replacement Grammars
Second-order abstract categorial grammars (de Groote 2001) and hyperedge replacement grammars (see Engelfriet 1997) are two natural ways of generalizing “context-free” grammar formalisms for string and tree languages. It is known that the string generating power of both formalisms is equivalent to (non-erasing) multiple context-free grammars (Seki et al. 1991) or linear context-free rewriting s...
متن کاملSome Results on Small Context-free Grammars Generating Primitive Words
In this report we characterize all context-free grammars with not more than three nonterminals generating only primitive words. 1This work was supported by the German-Hungarian Research Project 102 of OMFB ( Hungarian Research Foundation ) and Project X 233.6 of Forschungszentrum Karlsruhe
متن کامل